A Coordination Model for Agents based on Secure Spaces
نویسندگان
چکیده
Shared space coordination models such as Linda are ill-suited for structuring applications composed of erroneous or insecure components. This paper presents theSecure Object Space model. In this model, a data element can be locked with a key and is only visible to a process that presents a matching key to unlock the element. We give a precise semantics for Secure Object Space operations and discuss an implementation in JAVA for a mobile agent system. An implementation of the semantics that employs encryption is also outlined for use in untrusted environments.
منابع مشابه
Coordination Approach to Find Best Defense Decision with Multiple Possibilities among Robocup Soccer Simulation Team
In 2D Soccer Simulation league, agents will decide based on information and data in their model. Effective decisions need to have world model information without any noise and missing data; however, there are few solutions to omit noise in world model data; so we should find efficient ways to reduce the effect of noise when making decisions. In this article we evaluate some simple solutions whe...
متن کاملContext-Dependency in Internet-Agent Coordination
The design and development of Internet applications can take advantage of a paradigm based on autonomous and mobile agents. However, mobility introduces peculiar coordination problems in multiagent-based Internet applications. First, it suggests the exploitation of an infrastructure based on a multiplicity of local interaction spaces. Second, it may require coordination activities to be adapted...
متن کاملSecure Sharing of Tuple Spaces in Ad Hoc Settings
Security is emerging as a growing concern throughout the distributed computing community. Typical solutions entail specialized infrastructure support for authentication, encryption and access control. Mobile applications executing over ad hoc wireless networks present designers with a rather distinct set of security requirements. A totally open setting and limited resources call for lightweight...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملAuction-Based Agent Negotiation via Programmable Tuple Spaces
Auctions are proposed as a distributed negotiation mean, particularly useful in multiagent systems where both cooperative and self-interested agents compete for resources and services. The aim of this paper is to show how auction mechanisms on the Internet can be easily implemented by using programmable tuple spaces. Tuple spaces are shared repositories of information that follow the Linda mode...
متن کامل